#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;

struct pt
{
	double x, y;
	pt(double xe = 0, double ye = 0)
	{
		x = xe;
		y = ye;
	}
};

struct ln
{
	double a, b, c;
	ln(pt p1, pt p2)
	{
		a = (p2.y - p1.y);
		b = -(p2.x - p1.x);
		c = -p1.x * (p2.y - p1.y) + p1.y * (p2.x - p1.x);
	}
	ln(double ae = 0, double be = 0, double ce = 0)
	{
		a = ae;
		b = be;
		c = ce;
	}
};

struct elem
{
	bool line;
	pt p;
	ln l;
	elem(pt pe)
	{
		line = 0;
		p = pe;
	}
	elem(pt p1, pt p2)
	{
		line = 1;
		l = ln(p1, p2);
	}
	elem(ln le)
	{
		line = 1;
		l = ln(le);
	}
};


elem inter(elem e1, elem e2)
{
	if(!e1.line && !e2.line)
		return elem(e1.p, e2.p);
	if(!e2.line)
		swap(e1, e2);
	if(!e1.line)
	{
		e2 = inter(e2, elem(ln(-e2.l.b, e2.l.a, -e2.l.a * e1.p.y + e2.l.b * e1.p.x)));
		return elem(pt(2*e2.p.x - e1.p.x, 2*e2.p.y - e1.p.y));
	}
	else
	{
		double d = e1.l.a * e2.l.b - e1.l.b * e2.l.a;
		double dx = e1.l.c * e2.l.b - e1.l.b * e2.l.c;
		double dy = e1.l.a * e2.l.c - e1.l.c * e2.l.a;
		return elem(pt(-dx / d, -dy / d));
	}
}


char s[105];

elem parse(int& p)
{
	if(s[p] == '(' && s[p+1] == '(')
	{
		p++;
		elem e = parse(p);
		while(s[p] == '@')
		{
			p++;
			elem nx = parse(p);
			e = inter(e, nx);
		}
		p++;
		return e;
	}
	p++;
	double x, y;
	sscanf(s + p, "%lf", &x);
	while(s[p] != ',')
		p++;
	p++;
	sscanf(s + p, "%lf", &y);
	while(s[p] != ')')
		p++;
	p++;
	return elem(pt(x, y));
}

int main()
{
	while(1)
	{
		scanf("%s", s+1);
		if(s[1] == '#')
			break;
		s[0] = '(';
		int n = strlen(s);
		s[n] = ')';
		s[n+1] = 0;
		int p = 0;
		elem res = parse(p);
		if(fabs(res.p.x) < 0.000001)
			res.p.x = 0;
		if(fabs(res.p.y) < 0.000001)
			res.p.y = 0;
		printf("%.4lf %4lf\n", res.p.x, res.p.y);
	}
	
	return 0;
}
/*
((0,0)@(1,1))@((4,1)@(2,5))
((0,0)@(3,1))@((1,-3)@(2,-1))
(0,0)@(1,1)@(4,1)
(0,0)@((1,1)@(4,1))
(((0,0)@((10,20)@(((30,40))))))
((0,0)@(3,1))@((1,-3)@(2,-1))@(100,-100)@(100,100)
#
*/